Transient Behavior of Queueing Networks
نویسندگان
چکیده
We present algorithms for approximating time-varying performance parameters for a Gt/G/c queuing system and for networks of such stations. The key ingredient is a formula for computing approximate sojourn time distributions for a Gt/G/c queuing system with time-varying arrivals and phase-type service times. The formula is based on transient Little laws expressing expected queue lengths and outputs as integrals of “nonstationary” Palm distributions of sojourn times. The algorithms were designed for use in optimizing inputs to production and computer systems. Numerical examples show their accuracy.
منابع مشابه
A class of hierarchical queueing networks and their analysis
Queueing networks are an adequate model type for the analysis of complex system behavior. Most of the more realistic models are rather complex and do not fall into the easy solvable class of product form networks. Those models have to be analyzed by numerical solution of the underlying Markov chain and/or approximation techniques including simulation. In this paper a class of hierarchically str...
متن کاملRobust Transient Multi-Server Queues and Feedforward Networks
We propose an analytically tractable approach for studying the transient behavior of multi-server queueing systems and feedforward networks with deterministic routing. We model the queueing primitives via polyhedral uncertainty sets inspired by the limit laws of probability. These uncertainty sets are characterized by parameters that control the degree of conservatism of the model. Assuming the...
متن کاملDiffusion Approximation Models for Transient States and their Application to Priority Queues
The article presents a diffusion approximation model applied to investigate the behavior of priority queues. We discusses the use of the diffusion approximation in transient analysis of queueing models in the case of a single station and of a queueing network presenting the solutions. We emphasize the numerical aspect of the solution and analyze the errors. In classical queuing theory, the anal...
متن کاملTransient Analysis of M/M/R Machining System with Mixed Standbys, Switching Failures, Balking, Reneging and Additional Removable Repairmen
The objective of this paper is to study the M/M/R machine repair queueing system with mixed standbys. The life-time and repair time of units are assumed to be exponentially distributed. Failed units are repaired on FCFS basis. The standbys have switching failure probability q (0≤q≤1). The repair facility of the system consists of R permanent as well as r additional removable repairmen. Due to i...
متن کاملQueuing dynamics and single-link stability of delay-based window congestion control
Accurate modeling of queueing dynamics is important in the design and analysis of Internet congestion control. However, as demonstrated in this paper, existing window-based queueing models [26,30] are often not capable of precisely capturing the transient behavior (i.e., self-clocking and burstiness) of TCP-like protocols and their resulting analysis may be inaccurate in practice. As one exampl...
متن کاملOptimization of Stochastic Performance Analysis on Multi Class Queueing Network
Queueing network models have used lucratively to analyze the validation of multi resource system such as Computer systems and Communication Networks. This paper covenantal with the Stochastic analysis of queueing network with several classes of customers. Stochastic analysis describes the nature of the queueing networks and their applications, calculating the system performance. The measurable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006